On External-Memory Planar Depth First Search
نویسندگان
چکیده
منابع مشابه
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no spaceand I/O-efficient algorithms are known for depth-first search or breath-first search in sparse graphs. In this paper, we present two new results on I/O-efficient depth-first search in an important class of sparse graphs, namely undirected emb...
متن کاملAn Implementation of External-Memory Depth-First Search
In many different areas of computing, problems can arise which are too large to fit in main memory. For these problems, the I/O cost of moving data between main memory and secondary storage (for example, disks) becomes a significant bottleneck affecting the performance of the program. Since most algorithms do not take into account the size of main memory, new algorithms have been developed to o...
متن کاملOn Dynamic Breadth-First Search in External-Memory
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monotone update sequences of either Θ(n) edge insertions or Θ(n) edge deletions, we prove an amortized high-probability bound of O(n/B + sort(n) · log B) I/Os per update. In contrast, the currently best approach for static...
متن کاملOn nested depth first search
We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used.
متن کاملExternal-Memory Breadth-First Search with Sublinear I/O
Breadth-first search (BFS) is a basic graph exploration technique. We give the first external memory algorithm for sparse undirected graphs with sublinear I/O. The best previous algorithm requires (n + n+m D B logM=B n+m B ) I/Os on a graph with n nodes and m edges and a machine with main-memory of sizeM ,D parallel disks, and block size B. We present a new approach which requires only O(qn (n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2003
ISSN: 1526-1719
DOI: 10.7155/jgaa.00063